Jet subdivision schemes on the k-regular complex

نویسندگان

  • Yonggang Xue
  • Thomas Pok-Yin Yu
  • Tom Duchamp
چکیده

We introduce a new family of subdivision schemes called jet subdivision schemes. Jet subdivision schemes are a natural generalization of the commonly used subdivision schemes for free-form surface modeling. In an order r jet subdivision scheme, rth order Taylor expansions, or r-jets, of functions are the essential objects being generated in a coarse-to-fine fashion. Standard subdivision surface methods correspond to the case r = 0. Just as the standard free-form subdivision surface schemes, jet subdivision schemes are based on combining (i) a symmetric subdivision scheme in the shift-invariant setting with (ii) an extraordinary vertex rule. We formulate the notions of stationarity, symmetry, and smoothness for jet subdivision schemes. We then extend some well-known results in the theory of subdivision surfaces to the setting of jet subdivision schemes. By incorporating high order data into the subdivision rules, jet subdivision schemes offer more degrees of freedom for the design of extraordinary vertex rules than do standard subdivision schemes. Using a simple 2-point stencil, we construct an order 1 jet subdivision scheme, which is interpolatory, C1 everywhere, and free from polar artifacts at extraordinary vertices of any valence. It is similar to the popular butterfly scheme, but unlike the butterfly scheme, it produces surfaces that can be explicitly parameterized by spline functions. In addition, our jet subdivision scheme allows for explicit control of gradient information on the resulting surface. We address the problem of constructing curvature continuous subdivision schemes at extraordinary vertices by giving an example of a ‘flexible C2 scheme’ for extraordinary vertex of valence k = 3. The stencils for this subdivision scheme coincide with those of the popular Loop scheme. We discuss the mathematical structure of this example of a C2 scheme.  2006 Published by Elsevier B.V.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of C K -subdivision Surfaces at Extraordinary Points

This paper gives an analysis of surfaces generated by subdividing control nets of arbitrary topology. We assume that the underlying subdivision algorithm is stationary on the regular parts of the control nets and described by a matrix iteration around an extraordinary point. For these subdivision schemes we derive conditions on the spectrum of the matrix and its generalized eigenvectors such th...

متن کامل

Analysis of C subdivision surfaces at extraordinary points

This paper gives an analysis of surfaces generated by subdividing control nets of arbitrary topology We assume that the underlying subdivision al gorithm is stationary on the regular parts of the control nets and described by a matrix iteration around an extraordinary point For these subdivision schemes we derive conditions on the spectrum of the matrix and its gener alized eigenvectors such th...

متن کامل

A Topological Lattice Refinement Descriptor for Subdivision Schemes

The topological step of a subdivision scheme can be described as a refinement on regular tiling lattices, or more generally as a local transformation descriptor. The former classifies all the regular lattice transformations which give rise to other regular lattices. These regular lattice descriptors are limited by the type of the control mesh faces, the subdivided mesh must be composed by faces...

متن کامل

C K Continuity of Subdivision Surfaces

Stationary subdivision is an important tool for generating smooth free-form surfaces for CAGD and computer graphics. One of the challenges in construction of subdivision schemes for arbitrary meshes is to guarantee that the limit surface will have smooth regular parameterization in a neighborhood of any point. First results in this direction were obtained only recently. In this paper we derive ...

متن کامل

Generalized Catmull-Clark Subdivision

The Catmull-Clark subdivision algorithm consists of an operator that can be decomposed into a refinement operator and a successively executed smoothing operator, where the refinement operator splits each face with m vertices into m quadrilateral subfaces and the smoothing operator replaces each internal vertex with an affine combination of its neighboring vertices and itself. Over regular meshe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Aided Geometric Design

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2006